- complete matching
- мат.полное паросочетание
English-Russian scientific dictionary. 2008.
complete matching
Смотреть что такое "complete matching" в других словарях:
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Matching Mole — Origin Canterbury, England Genres Progressive rock (Canterbury Scene) Years active 1971–1972 1973 (unoffcially) Labels CBS … Wikipedia
Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn … Wikipedia
Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… … Wikipedia
Complete information — is a term used in economics and game theory to describe an economic situation or game in which knowledge about other market participants or players is available to all participants. Every player knows the payoffs and strategies available to other … Wikipedia
Matching pursuit — Signal reconstruction with matching pursuit algorithm. Matching pursuit is a type of numerical technique which involves finding the best matching projections of multidimensional data onto an over complete dictionary D. The basic idea is to… … Wikipedia
Matching polynomial — In graph theory and combinatorics, both fields within mathematics, a matching polynomial (sometimes called an acyclic polynomial) is a generating function of the numbers of matchings of various sizes in a graph. Contents 1 Definition 2… … Wikipedia
Matching — Match Match, v. t. [imp. & p. p. {Matched}; p. pr. & vb. n. {Matching}.] 1. To be a mate or match for; to be able to complete with; to rival successfully; to equal. [1913 Webster] No settled senses of the world can match The pleasure of that… … The Collaborative International Dictionary of English
Matching machine — Match Match, v. t. [imp. & p. p. {Matched}; p. pr. & vb. n. {Matching}.] 1. To be a mate or match for; to be able to complete with; to rival successfully; to equal. [1913 Webster] No settled senses of the world can match The pleasure of that… … The Collaborative International Dictionary of English
Complete mixing — In evolutionary game theory, complete mixing refers to an assumption about the type of interactions that occur between individual organisms. Interactions between individuals in a population attains complete mixing if and only if the probably… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
